Genetic algorithms with multi-parent recombination

نویسندگان

  • A. E. Eiben
  • Paul-Erik Raué
  • Zsófia Ruttkay
چکیده

In this paper we investigate genetic algorithms where more than two parents are involved in the recombination operation. In particular, we introduce gene scanning as a reproduction mechanism that generalizes classical crossovers, such as n-point crossover or uniform crossover, and is applicable to an arbitrary number (two or more) of parents. We performed extensive tests for optimizing numerical functions, the TSP and graph coloring to observe the effect of different numbers of parents. The experiments show that 2-parent recombination is outperformed when using more parents on the classical DeJong functions. For the other problems the results are not conclusive, in some cases 2 parents are optimal, while in some others more parents are better.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the effect of multi-parents recombination in binary coded genetic algorithms

-Recombination operator plays a very important role in genetic algorithms. In this paper, we present binary coded genetic algorithms in which more than two parents are involved in recombination operation. We propose two types of multi-parent recombination operators, the multi-cut (MX) and seed crossover (SX). Each of these operators is a natural generalization of two parents recombination opera...

متن کامل

Multi-parent Recombination with Simplex Crossover in Real Coded Genetic Algorithms

In this paper, we proposed simplex crossover (SPX), a multiparent recombination operator for real-coded genetic algorithms. SPX generates offspring vector values by uniformly sampling values from simplex formed by m (2 ≤ m ≤ number of parameters + 1) parent vectors. The SPX features an independence from of coordinate systems. Experimental results using test functions, which are commonly used in...

متن کامل

Multi-parent Recombination in Genetic Algorithms with Search Space Boundary Extension by Mirroring

Abstract. In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination with center of mass crossover (CMX) seems a good choice for real coded GAs. But CMX does not work well on functions which have their optimum on the corner of the search space. In this paper, we propose a meth...

متن کامل

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Most real-parameter genetic algorithms (RGAs) use a blending of participating parent solutions to create offspring solutions through its recombination operator. The blending operation creates solutions either around one of the parent solutions (having a parent-centric approach) or around the centroid of the parent solutions (having a mean-centric approach). In this paper, we argue that a self-a...

متن کامل

Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms

Abst rac t . In this paper we investigate the phenomenon of multi-parent reproduction, i.e. we study recombination mechanisms where an arbitrary n > 1 number of parents participate in creating children. In particular, we discuss scanning crossover that generalizes the standard uniform crossover and diagonal crossover that generalizes 1-point crossover, and study the effects of different number ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994